Global optimization of mixed-integer nonlinear programs: A theoretical and computational study

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global optimization of mixed-integer nonlinear programs: A theoretical and computational study

This work addresses the development of an efficient solution strategy for obtaining global optima of continuous, integer, and mixed-integer nonlinear programs. Towards this end, we develop novel relaxation schemes, range reduction tests, and branching strategies which we incorporate into the prototypical branch-and-bound algorithm. In the theoretical/algorithmic part of the paper, we begin by d...

متن کامل

Global Optimization of Mixed-Integer Nonlinear Programs

A variety of applications in economics, finance, engineering design, the chemical and biological sciences, and a host of other areas give rise to nonconvex nonlinear and mixed-integer nonlinear programs (NLPs and MINLPs). BARON was originally developed in the early 1990s as a computational system to facilitate experimentation with novel deterministic algorithms for global optimization. Since th...

متن کامل

Global Optimization of Mixed-Integer Nonlinear Problems

Two novel deterministic global optimization algorithms for nonconvex mixed-integer problems (MINLPs) are proposed, using the advances of the BB algorithm for noncon-vex NLPs Adjiman et al. (1998a). The Special Structure Mixed-Integer BB algorithm (SMIN-BB addresses problems with nonconvexities in the continuous variables and linear and mixed-bilinear participation of the binary variables. The G...

متن کامل

SCIP: Global Optimization of Mixed-Integer Nonlinear Programs in a Branch-and-Cut Framework

This paper describes the extensions that were added to the constraint integer programmingframework SCIP in order to enable it to solve convex and nonconvex mixed-integer nonlinearprograms (MINLPs) to global optimality. SCIP implements a spatial branch-and-bound algorithmbased on a linear outer-approximation, which is computed by convex overand underestimationof nonconvex functio...

متن کامل

Mixed-Integer Nonlinear Optimization

Many optimal decision problems in scientific, engineering, and public sector applications involve both discrete decisions and nonlinear system dynamics that affect the quality of the final design or plan. These decision problems lead to mixed-integer nonlinear programming (MINLP) problems that combine the combinatorial difficulty of optimizing over discrete variable sets with the challenges of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Programming

سال: 2004

ISSN: 0025-5610,1436-4646

DOI: 10.1007/s10107-003-0467-6